Co-cliques and star complements in extremal strongly regular graphs
نویسندگان
چکیده
منابع مشابه
Co-cliques and star complements in extremal strongly regular graphs
Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...
متن کاملRegular Star Complements in Strongly Regular Graphs
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50
متن کاملAn Example of Using Star Complements in Classifying Strongly Regular Graphs∗
In this paper we show how the star complement technique can be used to reprove the result of Wilbrink and Brouwer that the strongly regular graph with parameters (57, 14, 1, 4) does not exist.
متن کاملStar Complements in Regular Graphs: Old and New Results
We survey results concerning star complements in finite regular graphs, and note the connection with designs and strongly regular graphs in certain cases. We include improved proofs along with new results on stars and windmills as star complements. AMS Classification: 05C50
متن کاملExtremal graphs for intersecting cliques
For any two positive integers nXrX1; the well-known Turán Theorem states that there exists a least positive integer exðn;KrÞ such that every graph with n vertices and exðn;KrÞ þ 1 edges contains a subgraph isomorphic to Kr: We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex. r 2003 Elsevier Science (U...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.04.002